The substitution schema in recursive arithmetic.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FPGA Based Cipher Design & Implementation of Recursive Oriented Block Arithmetic and Substitution Technique (ROBAST).docx

Proposed FPGA based technique considers a message as a binary string on which ROBAST is applied. A block of n-bits is taken as an input stream, where n ranges from 8 to 256 – bit, then ROBAST is applied in each block to generate intermediate stream, any one intermediate stream is considered as a cipher text. The same operation is performed repeatedly on various block sizes. It is a kind of bloc...

متن کامل

Recursive Schema Definitions in Object-Z

Unlike Z, Object-Z allows schemas to be defined recursively. This enables mutual and self recursive structures, commonly occurring in object-oriented programs, to be readily specified. In this paper, we provide a fixed point interpretation of such definitions. In addition, we provide simple guidelines for producing non-recursive schema definitions which are semantically identical to recursive o...

متن کامل

Nonstandard arithmetic and recursive comprehension

First order reasoning about hyperintegers can prove things about sets of integers. In the author’s paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic Logic 12 (2006), it was shown that each of the “big five” theories in reverse mathematics, including the base theory RCA0, has a natural nonstandard counterpart. But the counterpart RCA0 of RCA0 has a defect: it does not im...

متن کامل

Formalized Interpretability in Primitive Recursive Arithmetic

Interpretations are a natural tool in comparing the strength of two theories. In this paper we give a brief introduction to the topic of interpretability and interpretability logics. We will focus on the, so far, unknown interpretability logic of PRA. One research technique will be treated. This technique can be best described as restricting the realizations in the arithmetical semantics. 1 Wha...

متن کامل

A General Recursive Schema for Argumentation Semantics

In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics has been introduced to solve the problems related to counterintuitive results produced by literature proposals. In this semantics, an important role is played by a recursive schema in the definition of extensions. This paper pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1965

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093958257